Allocating service periods to minimize delay time

Scheduling a Time - Shared Server to Minimize Aggregate Delay

A 1967 paper by Rangarajan and Oliver [1)1 contains a formulation and analysis of the two problems described below, which pertain to the allocation of servicing times among N incoming streams requiring "processing" of some kind by a single "server." The server might for example be a switching point or a congestion point (e.g., a tunnel entrance) in a transport network, in which case "processing...

Clustering in Hypergraphs to Minimize Average Edge Service Time

We study the problem of clustering the vertices of a weighted hypergraph such that on average the vertices of each edge can be covered by a small number of clusters. This problem has many applications such as for designing medical tests, clustering files on disk servers, and placing network services on servers. The edges of the hypergraph model groups of items that are likely to be needed toget...

Radio-Aware Service-Level Scheduling to Minimize Downlink Traffic Delay Through Mobile Edge Computing

One of the most challenging problems in mobile broadband networks is how to assign the available radio resources among the different mobile users. Traditionally, research proposals are either specific to some type of traffic or deal with computationally intensive algorithms aimed at optimizing the delivery of general purpose traffic. Consequently, commercial networks do not incorporate these me...

Sequencing and Allocating Attorney Time to Cases

Allocating Cost of Service to Customers in Inventory Routing

Vendor managed inventory (VMI) replenishment is a collaboration between a supplier and its customers where the supplier is responsible for managing the customers’ inventory levels. In the VMI setting we consider, the supplier exploits synergies between customers, e.g., their locations, usage rates, and storage capacities, to reduce distribution costs. Due to the intricate interactions between c...